A Short Note on Intuitionistic Propositional Logic with Multiple Conclusions
نویسندگان
چکیده
It is a common misconception among logicians to think that intuitionism is necessarily tied-up with single conclusion (sequent or Natural Deduction) calculi. Single conclusion calculi can be used and are convenient, but they are by no means necessary, as shown by such influential authors as Kleene, Takeuti and Dummett, to cite only three. If single conclusions are not necessary, how do we guarantee that only intuitionistic derivations are allowed? Traditionally one insists on restrictions on particular rules: implication right, negation right and universal quantification right are required to be single conclusion rules. In this note we show that instead of a cardinality restrictionm such as one conclusion only, we can use a notion of dependency between formulae to enforce the constructive character of derivations. Since Gentzen’s pioneering work it has been traditional to associate intuitionism with a single-conclusion sequent calculus or Natural Deduction system. Gentzen’s own sequent calculus presentation of intuitionistic logic, the famous system LJ, is obtained from his classical system LK by means of a cardinality restriction imposed on the succedent of every sequent. It is well-known that Gentzen’s formulation of classical logic, the system LK, uses sequents, expressions of the form Γ ⇒ ∆, where both Γ and ∆ may contain several formula occurrences. The intuition is that the conjunction of the formulae in Γ entails the disjunction of the formulae in ∆. In Gentzen’s calculus for intuitionistic logic LJ sequents are restricted to succedents with at most one formula occurrence. This is convenient, but by no means necessary. Since at least Maehara’s work in the fifties (see [Mae54]) it has been known that intuitionistic logic can be presented via a multiple-conclusion system. Maehara’s system is described in Takeuti’s influential book ([Tak75]), which calls the system LJ’. Also Kleene in his monograph ([Kl52]) presents systems which constitute multiple-conclusion versions of intuitionistic logic. But while both of these (classes of) systems stick to the idea that sequents can have multiple conclusions, they still keep some form of (local) cardinality restriction on succedents: the rules for implication right, negation right and universal quantification right must be modified in that they can only be performed if there is a single formula in the succedent of the premise to which these rules are applied. If we
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملDe Jongh’s characterization of intuitionistic propositional calculus
In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional calculus IPC in terms of the Kleene slash. In this note we give a proof of this result using the technique of the universal models.
متن کاملDecidability of Quantified Propositional Intuitionistic Logic and S4 on Trees
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a model structure which is upward closed, i.e., if h ∈ P , then h ∈ P for all h ≤ h. For propositional intuitionistic logic H, several classes of model structures are known...
متن کاملEmbedding Gödel propositional logic into Prior’s tense logic
The well-known Gödel translation embeds intuitionistic propositional logic into the modal logic S4. In this note, we use essentially the same translation to embed Gödel infinitevalued propositional logic into a schematic extension of Prior’s bimodal tense logic that allows finite chains only as flows of time. While our proofs use elementary techniques in many-valued algebraic logic, our embeddi...
متن کاملEvery super-polynomial proof in purely implicational minimal logic has a polynomially sized proof in classical implicational propositional logic
In this note we show how any formula δ with a proof of super-polynomial size in M→ has a poly-sized proof in K→ . This fact entails that any propositional classical tautology has short proofs, i.e., NP=CoNP. 1 Every classical tautology has short proofs This article reports the results on the investigation on the existence of short proofs for every Classical Propositional Logic tautology. Firstl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005